搜索资源列表
sa_01.zip
- 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。,This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01.
matlab.rar
- 不错的程序，欢迎下载，登山算法，解决背包问题，不错,Good program, please download, climbing algorithm to solve knapsack problem, yes
xujinpeng-matlab.rar
- 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
GQA.rar
- 遗传量子算法求解背包问题Matlab源码,Quantum Genetic Algorithm for Knapsack Problem
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
beibao
- 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
an
- 利用模拟退火解决0-1背包问题，适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
NIP
- matlab 7.0 以上版本提供了强大的优化工具箱，但在整数规划方面，只提供了bintprog（）这个m文件以求解0－1整数规划，而对于一般的整数规划模型没有具体的算法提供。我们一般情况只是用最简单的分值定界思想编写matlab程序求解整数规划问题，但效率低下，如何利用求解整数规划的先进算法编写matlab程序提上日程，香港大学的李端和复旦大学编写的《Nonlinear Integer Programming》(非线性整数规划)为编写解决整数规划问题提供强大有效的算法，其中算法针对具体问题包括
0-1-knapsack-problem
- 模拟退火解决0-1背包问题，初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
gabags
- 网站上关于遗传算法开发可谓工具箱满天飞。可工具箱超级难用。鉴于此，本人自己完全用matlab实现遗传算法解决多背包问题并留了qq。-Web site development on the genetic algorithm toolbox is all over the place. Toolbox can be super hard to use. In view of this, I am not at all with the realization of genetic algorith
TSP
- 解决背包问题 自动求解最大价值 利益最大化问题-Automatically solve the Knapsack Problem to maximize the interests of maximizing the value of solving the problem
1
- Matlab code for knapsack
KnapsackProblem
- 这是用MATLAB编写的模拟退火算法求解背包问题的程序-This is prepared using MATLAB algorithm simulated annealing procedure for Knapsack Problem
PSO_Solving_Multi_Aims
- 货物配装问题实质上是背包问题与装箱问题的混合，有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划，最大限度地发挥货车容积和承载能力，从而降低配送成本。-Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with a wide range of applications.
SA
- 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about fr
pso_01
- 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
knapsack-ga
- knapsack genet algorithm
PSO-for-knapsack-problem
- pso算法在背包问题中的matlab程序。-pso algorithm in the knapsack problem in the matlab program.